Non-abelian convexity by symplectic cuts

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Non-abelian convexity by symplectic cuts dg-ga/9603015

In this paper we extend the results of Kirwan et alii on convexity properties of the moment map for Hamiltonian group actions, and on the connectedness of the fibers of the moment map, to the case of non-compact orbifolds. Our motivation is twofold. First, the category of orbifolds is important in symplectic geometry because, generically, the symplectic quotient of a symplectic manifold is an o...

متن کامل

Depth-Optimized Convexity Cuts

This paper presents a general, self-contained treatment of convexity or intersection cuts. It describes two equivalent ways of generating a cut — via a convex set or a concave function — and a notion of strong cuts. We then characterize the structure of the sets and functions that generate strong cuts. We then specialize the framework to the case of mixed-integer linear programming (MIP). For t...

متن کامل

Cohomology rings of symplectic cuts

The “symplectic cut” construction [Le] produces, from a symplectic manifold M with a Hamiltonian circle action, two symplectic orbifolds C − and C+. We compute the rational cohomology ring of C+ in terms of those of M and C − . 1 Statement of the results Let M be a symplectic n-manifold endowed with an Hamiltonian S1-action with moment map f : M → R. Suppose that 0 is a regular value of f and c...

متن کامل

Symplectic Cuts and Projection Quantization

The recently proposed projection quantization, which is a method to quantize particular subspaces of systems with known quantum theory, is shown to yield a genuine quantization in several cases. This may be infered from exact results established within symplectic cutting.

متن کامل

Improved Convexity Cuts for Lattice Point Problems

The generalized lattice point (GLF) problem provides a formulation that accommodates a var.lety of discrete alternative problems. In this paper we show how to substantlrlly strengthen the convexity cuts for the GLF problem. The new cuts are based on the identification of "synthesized" lattice point conditions to replace those that ordinarily define the cut. The synthesized conditions give an al...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Topology

سال: 1998

ISSN: 0040-9383

DOI: 10.1016/s0040-9383(97)00030-x